On the expressive power of first-order boolean functions in PCF
نویسندگان
چکیده
Recent results of Bucciarelli show that the semilattice of degrees of parallelism of firstorder boolean functions in PCF has both infinite chains and infinite antichains. By considering a simple subclass of Sieber’s sequentiality relations, we identify levels in the semilattice and derive inexpressibility results concerning functions on different levels. This allows us to further explore the structure of the semilattice of degrees of parallelism: we identify semilattices characterized by simple level properties, and show the existence of new infinite hierarchies which are in a certain sense natural with respect to the levels.
منابع مشابه
Boolean Dependence Logic and Partially-Ordered Connectives
We introduce a new variant of dependence logic (D) called Boolean dependence logic (BD). In BD dependence atoms are of the type =(x1, . . . , xn, α), where α is a Boolean variable. Intuitively, with Boolean dependence atoms one can express quantification of relations, while standard dependence atoms express quantification over functions. We compare the expressive power of BD to D and first-orde...
متن کاملFirst order formulas with modular predicates
Two results by Schützenberger (1965) and by McNaughton and Papert (1971) lead to a precise description of the expressive power of first order logic on words interpreted as ordered colored structures. In this paper, we study the expressive power of existential formulas and of Boolean combinations of existential formulas in a logic enriched by modular numerical predicates. We first give a combina...
متن کاملThe Expressive Power of Binary Submodular Functions
It has previously been an open problem whether all Boolean submodular functions can be decomposed into a sum of binary submodular functions over a possibly larger set of variables. This problem has been considered within several different contexts in computer science, including computer vision, artificial intelligence, and pseudo-Boolean optimisation. Using a connection between the expressive p...
متن کاملProgramming Language Expressiveness and Circuit Complexity
This paper is a continuation of the work begun in 5] on establishing relative intensional expressiveness results for programming languages. Language L 1 is intensionally more expressive than L 2 , if L 1 can compute all the functions L 2 can, with at least the same asymptotic complexity. The question we address is: Does nondeterministic parallelism add intensional expressiveness? We compare det...
متن کاملTotality, Definability and Boolean Ciruits
1 I n t r o d u c t i o n Adding parallel constants to a p rog ramming language strict ly increase the expressive power of the language, in general. For instance, extending Scot t ' s P C F with parallel-or, one can define any finite continuous funct ion [7]. However, it is an open problem whether parallelism adds expressive power, if we restrict our attent ion to total functions. Total i ty is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 266 شماره
صفحات -
تاریخ انتشار 2001